Complete Problems for Fixed-Point Logics
نویسنده
چکیده
The notion of logical reducibilities is derived from the idea of interpretations between theories. It was used by Lovász and Gács [LG77] and Immerman [Imm87] to give complete problems for certain complexity classes and hence establish new connections between logical definability and computational complexity. However, the notion is also interesting in a purely logical context. For example, it is helpful to establish non-expressibility results.
منابع مشابه
Guarded Fixed Point Logic
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of firstorder logic that were recently introduced by Andréka, van Benthem and Németi. Guarded fixed point logics can also be viewed as the natural common extensions of the modal -calculus and the guarded fragments. We prove that the satisfiability problems for guarded fixed point logics ar...
متن کاملThe decidability of guarded fixed point logic
Guarded fixed point logics are obtained by adding least and greatest fixed points to the guarded fragments of first-order logic that were recently introduced by Andréka, van Benthem and Németi. Guarded fixed point logics can also be viewed as the natural common extensions of the modal μ-calculus and the guarded fragments. In a joint paper with Igor Walukiewicz, we proved recently that the satis...
متن کاملInformatik MCL Master ’ s Thesis on The Subsumption Problem of the Fuzzy Description Logic
Because of the simplicity in the structure of the Description Logic (DL) FL0, it has been commonly taken as the first example for the presentation of new notions and their associated problems [1],[2]. Fuzzy Description Logics extend classical Description Logics by allowing truth degrees to deal with imprecise concepts. In this work we show that in the fuzzy DL FL0 with greatest fixed-point sema...
متن کاملComparing Tableaux, Automata and Games for Modal and Temporal Logics
Logics have proved to be a valuable mathematical tool for various areas in computer science, computational linguistics, artificial intelligence, etc. because they provide formal frameworks that allow to reason about structures. Several problems arise with every logic. E.g. it must be known how to prove satisfiability of a formula φ (Is there a model for φ?) or validity (Is every interpretation ...
متن کاملStrong Completeness Theorems for Weak Logics of Common Belief
We show that several logics of common belief and common knowledge are not only complete, but also strongly complete, hence compact. These logics involve a weakened monotonicity axiom, and no other restriction on individual belief. The semantics is of the ordinary fixed-point type.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Symb. Log.
دوره 60 شماره
صفحات -
تاریخ انتشار 1995